package branch_algorithm_study;

import java.util.Arrays;
import java.util.Scanner;

public class Trigonometric_Function {
    public static void main(String[] args) {
        int[] arr = new int[3];
        Scanner scanner = new Scanner(System.in);
        for (int i = 0; i < arr.length; i++) {
            arr[i] = scanner.nextInt();
        }
        Arrays.sort(arr);
        int i = Trigonometric_Function.euclidean_algorithm(arr[0], arr[2]);

        System.out.println(arr[0] / i + "/" + arr[2] / i);
    }
    public static int euclidean_algorithm(int a, int b) {
        int gcd=0;
        for (int min = Math.min(a, b); min >= 1; min--) {
            if (a % min == 0 & b % min == 0) {
                gcd = min;
                break;
            }
        }
        return gcd;
    }
}
